Whitney type inequalities for local anisotropic polynomial approximation
نویسندگان
چکیده
منابع مشابه
Whitney type inequalities for local anisotropic polynomial approximation
We prove a multivariate Whitney type theorem for the local anisotropic polynomial approximation in Lp(Q) with 1 ≤ p ≤ ∞. Here Q is a d-parallelepiped in R with sides parallel to the coordinate axes. We consider the error of best approximation of a function f by algebraic polynomials of fixed degree at most ri− 1 in variable xi, i = 1, ..., d, and relate it to a so-called total mixed modulus of ...
متن کاملOn Bernstein Type Inequalities for Complex Polynomial
In this paper, we establish some Bernstein type inequalities for the complex polynomial. Our results constitute generalizations and refinements of some well-known polynomial inequalities.
متن کاملWhitney Number Inequalities for Geometric Lattices
Let L be a finite geometric lattice of rank r, and for i =0, I, •• •» r, let W. denote the number of elements of L with rank i. F or 1 < k < r 2, we have W, + W. + • • • + V, < W ,+•••+ W ., + W , 12 fe r—k r—l r—1 with equality if and only if the lattice L is modular. We give two further results concerning matchings of lattice elements of rank < k into those of rank > r — k, and observe that a...
متن کاملOn Lebesgue-type inequalities for greedy approximation
We study the efficiency of greedy algorithms with regard to redundant dictionaries in Hilbert spaces. We obtain upper estimates for the errors of the Pure GreedyAlgorithm and the Orthogonal GreedyAlgorithm in terms of the best m-term approximations. We call such estimates the Lebesgue-type inequalities. We prove the Lebesgue-type inequalities for dictionaries with special structure. We assume t...
متن کاملWhitney Estimates for Convex Domains with Applications to Multivariate Piecewise Polynomial Approximation
We prove the following Whitney estimate. Given 0 < p ≤ ∞, r ∈ N, and d ≥ 1, there exists a constant C(d, r, p), depending only on the three parameters, such that for every bounded convex domain ⊂ Rd , and each function f ∈ L p( ), Er−1( f, )p ≤ C(d, r, p)ωr ( f, diam( ))p, where Er−1( f, )p is the degree of approximation by polynomials of total degree, r − 1, and ωr ( f, ·)p is the modulus of s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 2011
ISSN: 0021-9045
DOI: 10.1016/j.jat.2011.06.004